Sparse multidimensional modal analysis using a multigrid dictionary refinement
نویسندگان
چکیده
منابع مشابه
Sparse multidimensional modal analysis using a multigrid dictionary refinement
We address the problem of multidimensional modal estimation using sparse estimation techniques coupled with an efficient multigrid approach. Modal dictionaries are obtained by discretizing modal functions (damped complex exponentials). To get a good resolution, it is necessary to choose a fine discretization grid resulting in intractable computational problems due to the huge size of the dictio...
متن کاملMass Properties Identification of a Rigid Body Using Modal Analysis
In performing vibration analysis of the car engine on the engine support, it is necessary to know the mass properties of the engine including mass, position of the center of mass and mass inertia moments. Because the car engine has a relatively complex geometric shape and is composed of different components with different densities, determining its mass properties faces many challenges. There a...
متن کاملSparse Multidimensional Representation using Shearlets
In this paper we describe a new class of multidimensional representation systems, called shearlets. They are obtained by applying the actions of dilation, shear transformation and translation to a fixed function, and exhibit the geometric and mathematical properties, e.g., directionality, elongated shapes, scales, oscillations, recently advocated by many authors for sparse image processing appl...
متن کاملUsing Sparse Tiling with Symmetric Multigrid
Good data locality is an important aspect of obtaining scalable performance for multigrid methods. However, locality can be difficult to achieve, especially when working with unstructured grids and sparse matrices whose structure is not known until runtime. Our previous work developed full sparse tiling, a runtime reordering and rescheduling technique for improving locality. We applied full spa...
متن کاملMultigrid multidimensional scaling
Multidimensional scaling (MDS) is a generic name for a family of algorithms that construct a configuration of points in a target metric space from information about inter-point distances measured in some other metric space. Large-scale MDS problems often occur in data analysis, representation and visualization. Solving such problems efficiently is of key importance in many applications. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2012
ISSN: 1687-6180
DOI: 10.1186/1687-6180-2012-60